Monitoring the stage of diagonalization in Jacobi-type methods
نویسنده
چکیده
Since the stage of diagonalization of Jacobi–type methods is difficult to monitor in a parallel environment, it is usually proposed to execute a predetermined number of sweeps (iterations) on a parallel processor array. A possibility for monitoring the stage of diagonalization is essential in order to avoid the execution of a significant number of unnecessary sweeps. Based on a Lemma used for a generalized proof of the quadratic convergence of the Jacobi EVD and SVD methods a new criteria for monitoring the stage of diagonalization is derived. Using this criteria it can easily be monitored when the stage of quadratic convergence is reached (only one bit yields this information). Therefore,only the (small) number of quadratically convergent sweeps must be predetermined. A further similiar criteria particularly useful for Jacobi–type methods using CORDIC–based approximate rotations is also given.
منابع مشابه
Simple LU and QR Based Non-orthogonal Matrix Joint Diagonalization
A class of simple Jacobi-type algorithms for non-orthogonal matrix joint diagonalization based on the LU or QR factorization is introduced. By appropriate parametrization of the underlying manifolds, i.e. using triangular and orthogonal Jacobi matrices we replace a high dimensional minimization problem by a sequence of simple one dimensional minimization problems. In addition, a new scale-invar...
متن کاملBlock-Jacobi Methods with Newton-Steps and Non-unitary Joint Matrix Diagonalization
In this work, we consider block-Jacobi methods with Newton steps in each subspace search and prove their local quadratic convergence to a local minimum with non-degenerate Hessian under some orthogonality assumptions on the search directions. Moreover, such a method is exemplified for non-unitary joint matrix diagonalization, where we present a block-Jacobi-type method on the oblique manifold w...
متن کاملGlobally convergent Jacobi-type algorithms for simultaneous orthogonal symmetric tensor diagonalization
In this paper, we consider a family of Jacobi-type algorithms for simultaneous orthogonal diagonalization problem of symmetric tensors. For the Jacobi-based algorithm of [SIAM J. Matrix Anal. Appl., 2(34):651–672, 2013], we prove its global convergence for simultaneous orthogonal diagonalization of symmetric matrices and 3rd-order tensors. We also propose a new Jacobi-based algorithm in the gen...
متن کاملDiagonalization in Parallel Space
Matrix diagonalization is an important component of many aspects of computational science. There are a variety of algorithms to accomplish this task. Jacobi’s algorithm is a good choice for parallel environments. Jacobi’s algorithm consists of a series of matrix plane rotations, the ordering of which can dramatically affect performance. We show a new ordering which cuts the number of necessary ...
متن کاملJacobi Angles for Simultaneous Diagonalization. Jean-fran
Simultaneous diagonalization of several matrices can be implemented by a Jacobi-like technique. This note gives the required Jacobi angles in close form.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994